Asymptotically optimal amplifiers for the Moran process
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Amplifiers for the Moran Process
We study the Moran process as adapted by Lieberman, Hauert and Nowak. A family of directed graphs is said to be strongly amplifying if the extinction probability tends to 0 when the Moran process is run on graphs in this family. The most-amplifying known family of directed graphs is the family of megastars of Galanis et al. We show that this family is optimal, up to logarithmic factors, since e...
متن کاملAmplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs
We consider the classic Moran process modeling the spread of genetic mutations, as extended to structured populations by Lieberman et al. (Nature, 2005). In this process, individuals are the vertices of a connected graph G. Initially, there is a single mutant vertex, chosen uniformly at random. In each step, a random vertex is selected for reproduction with a probability proportional to its fit...
متن کاملAbsorption Time of the Moran Process
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to become extinct. It is known that the expected absorption time for an advantageous mutation is O(n) on an n-vertex undirected graph, which allows ...
متن کاملAsymptotically Optimal Mappings for BICM
We prove the asymptotic optimality of particular binary labeling rules for M -PAM and MQAM constellations in the wideband regime in terms of the so-called parallel-decoding capacity aka. bit-interleaved coded modulation capacity. Shannon’s ultimate limit of −1.59 dB can be achieved with bit-interleaved coded modulation. January 13, 2009 DRAFT
متن کاملStochastic Evolution as a Generalized Moran Process
This paper proposes and analyzes a model of stochastic evolution in finite populations. The expected motion in our model resembles the standard replicator dynamic when the population is large, but is qualitatively different when the population size is small, due to the difference between maximizing payoff and maximizing relative payoff. Moreover, even in large populations the asymptotic behavio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.08.005